Eecient Ampliiers and Bounded Degree Optimization
نویسندگان
چکیده
This paper studies the existence of eecient (small size) ampliiers for proving explicit inaproximability results for bounded degree and bounded occurrence combinatorial optimization problems, and gives an explicit construction for such ampliiers. We use this construction to improve the currently best known approximation lower bounds for bounded occurrence instances of linear equations mod 2, and for bounded degree (regular) instances of MAX-CUT. In particular we prove the approximation lower bound of 152/152 for exactly 3-occurrence E3-OCC-E2-LIN-2 problem, and MAX-CUT problem on 3-regular graphs, E3-MAX-CUT, and the approximation lower bound of 121/120 for E3-OCC-2-LIN-2 problem. As an application we are able to improve also the best known approximation lower bound for E3-OCC-MAX-E2SAT.
منابع مشابه
CMOS Operational Ampli er Design and Optimization via Geometric
| We describe a general method for optimized design of CMOS operational ampliiers. We observe that a wide variety of design objectives and constraints have a special form, i.e., they are posynomial functions of the design variables. As a result, the ampliier design problem can be expressed as a special form of optimization problem called geometric programming, for which very eecient global opti...
متن کاملEecient Construction of a Bounded Degree Spanner with Low Weight
Let S be a set of n points in IR d and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p; q of points there is a path between them of length at most t times the Euclidean distance between p and q. An eecient implementation of a greedy algorithm is given that constructs a t-spanner having bounded degree such that the total le...
متن کاملLow - degree Graph Partitioning via Local Searchwith Applications to Constraint Satisfaction
We present practical algorithms for constructing partitions of graphs into a xed number of vertex-disjoint subgraphs that satisfy particular degree constraints. We use this in particular to nd k-cuts of graphs of maximum degree that cut at least a k?1 k (1 + 1 22+k?1) fraction of the edges, improving previous bounds known. The partitions also apply to constraint networks, for which we give a ti...
متن کاملA Fast Multicast Routing Algorithm for Delay-Sensitive Applications
EEcient algorithm for model further extended to allow \dynamic membership" (to appear at INFOCOM'98). EEcient algorithm for low-degree multicast tree problem. 19 Conclusions Proposed algorithm produces near-optimal multicast trees for small and sparse networks. Quality of solution is maintained even when size and density of networks grow. Computation time is polynomially bounded and expected to...
متن کاملOn the extremal total irregularity index of n-vertex trees with fixed maximum degree
In the extension of irregularity indices, Abdo et. al. [1] defined the total irregu-larity of a graph G = (V, E) as irrt(G) = 21 Pu,v∈V (G) du − dv, where du denotesthe vertex degree of a vertex u ∈ V (G). In this paper, we investigate the totalirregularity of trees with bounded maximal degree Δ and state integer linear pro-gramming problem which gives standard information about extremal trees a...
متن کامل